Approximate proper efficiency for multiobjective optimization problems
نویسندگان
چکیده
منابع مشابه
Optimality Conditions for Approximate Solutions in Multiobjective Optimization Problems
We study firstand second-order necessary and sufficient optimality conditions for approximate weakly, properly efficient solutions of multiobjective optimization problems. Here, tangent cone, -normal cone, cones of feasible directions, second-order tangent set, asymptotic second-order cone, and Hadamard upper lower directional derivatives are used in the characterizations. The results are first...
متن کاملProper efficiency and duality for a new class of nonconvex multitime multiobjective variational problems
*Correspondence: [email protected] 1Faculty of Applied Sciences, University ‘Politehnica’ of Bucharest, Splaiul Independenţei, No. 313, Bucharest, 060042, Romania Full list of author information is available at the end of the article Abstract In this paper, a new class of generalized of nonconvex multitime multiobjective variational problems is considered. We prove the sufficient optimality...
متن کاملSequential Approximate Multiobjective Optimization Using Computational Intelligence
In many practical problems, in particular in engineering design, the function form of criteria is not given explicitly in terms of design variables. Given the value of design variables, under this circumstance, the value of objective functions is obtained by real/computational experiments such as structural analysis, fluidmechanic analysis, thermodynamic analysis, and so on. Usually, these expe...
متن کاملTabu Programming for Multiobjective Optimization Problems
In this paper, tabu programming for solving multiobjective optimization problems has been considered. Tabu search algorithm has been extended by using a computer program instead of a mathematical variable. For finding Paretooptimal solutions, the ranking procedure in the neighborhood of the current solutions has been applied. Moreover, the multiobjective optimization problem of task assignment ...
متن کاملConjugate duality for multiobjective composed optimization problems
Given a multiobjective optimization problem with the components of the objective function as well as the constraint functions being composed convex functions, we introduce, by using the Fenchel-Moreau conjugate of the functions involved, a suitable dual problem to it. Under a standard constraint qualification and some convexity as well as monotonicity conditions we prove the existence of strong...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2019
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil1918091g